Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
951	Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions Jacques Patarin1 , Val´erie Nachef2 , and Cˆome Berbain3 1 Universit´e de Versailles 45 avenue des Etats-Unis, 78035 Versailles Cedex, France Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-04-05 08:31:35 Expected value Computational complexity theory Mathematics Advantage Permutation
952	Approximating matching size from random streams Michael Kapralov⇤ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 NP-complete problems Matching SL Randomized algorithm Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
953	Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-15 09:42:20 Cryptographic protocols Probabilistic complexity theory Complexity classes Interactive proof system Proof of knowledge Zero-knowledge proof IP Soundness Commitment scheme Theoretical computer science Applied mathematics Computational complexity theory
954	PDF Document Add to Reading List Source URL: uts.cc.utexas.edu Language: English - Date: 2009-10-20 00:03:14 Algorithm Computational complexity theory Pragmatics Mathematics Philosophy of language Applied mathematics PP Quantum complexity theory
955	Pebbling and Proofs of Work Cynthia Dwork1 , Moni Naor2? , and Hoeteck Wee3?? 1 Microsoft Research, Silicon Valley Campus, 2 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2008-09-15 04:53:13 Graph pebbling CPU cache Connectivity Directed acyclic graph Computational complexity theory Randomized algorithm Theoretical computer science Mathematics Applied mathematics
956	Computational Extractors and Pseudorandomness Dana Dachman-Soled ∗ Rosario Gennaro† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-12-28 18:41:58 Randomness Pseudorandomness Computational complexity theory Information theory Randomness extractor Extractor Pseudorandom generator Min-entropy Screw extractor Theoretical computer science Applied mathematics Mathematics
957	Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2010-03-23 06:34:16 Mathematical logic Combinatorial optimization Matching Automata theory Finite-state machine Algorithm Discrete mathematics Graph theory Computational complexity theory Mathematics Theoretical computer science Applied mathematics
958	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data∗ Yevgeniy Dodis† Rafail Ostrovsky‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-04-01 12:50:42 Randomness Computational complexity theory Information theory Randomness extractor Coding theory Extractor List decoding Entropy Min-entropy Theoretical computer science Applied mathematics Cryptography
959	CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10 Add to Reading List Source URL: www.cmi.ac.in Language: English - Date: 2013-02-28 10:49:50 Analysis of algorithms Computational complexity theory Algorithm Mathematical logic Dynamic programming Time complexity ATS Randomized algorithm Pseudorandom generator theorem Theoretical computer science Applied mathematics Mathematics
960	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics

UPDATE